Crossover and Mutation Strategies applied in Job Shop Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Flexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملMathematical Models of Flow Shop and Job Shop Scheduling Problems
In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem ...
متن کاملJob Shop Scheduling Problems withControllable Processing
Most scheduling models assume that the jobs have xed processing times. However, in real-life applications the processing time of a job often depends on the amount of resources such as facilities, manpower , funds, etc. allocated to it, and so its processing time can be reduced when additional resources are assigned to the job. A scheduling problem in which the processing times of the jobs can b...
متن کاملGenetic Algorithms for Job-Shop Scheduling Problems
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملA Genetic Algorithm with Multi-Step Crossover for Job-Shop Scheduling Problems
Genetic Algorithms (GAs) have been designed as general purpose optimization methods. GAs can be uniquely characterized by their population-based search strategies and their operators: mutation, selection and crossover. In this paper, we propose a new crossover called multi-step crossover (MSX) which utilizes a neighborhood structure and a distance in the problem space. Given parents, MSX succes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2019
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1377/1/012031